Partial Stable Generated Models of Generalized Logic Programs with Constraints

Logic programs are an important knowledge representation tool. In many cases, definite logic programs are too restricted to formalize problems intuitively. Therefore definite logic programs have been extended in several ways by additional syntactic constructs such as negation and disjunction. A very expressive program class are generalized logic programs. Their rules may contain any quantifier free formula in both their body and head. Definite, normal and disjunctive logic programs are special cases of generalized logic programs. Constraint logic programming, defined in [4], extends definite logic programs by constraints: logical expressions that describe special properties of the problem domain. The combination of these two extensions defines the syntax of generalized logic programs with constraints (GLPC).